Analysis on the Tmnp- Scheduling Algorithm for Industrial Wireless Network

In order to improve real-time in industrial wireless network, the TMNP-scheduling algorithm (scheduling algorithm based on throughput maximization of non-periodic communication tasks) is proposed in this paper. The basic principles of TMNP-scheduling algorithm are analyzed, and a theory proof has been finished. The theory proof shows that TMNP-scheduling algorithm optimizes communication window debris. Compared with typical scheduling strategy of application layer in industrial control network, the TMNP-scheduling algorithm improves throughput of non-periodic communication tasks in industrial wireless network. At the same time, the nonlinear programming model is founded to generate scheduling timetable based on TMNP-scheduling algorithm. Finally, a simulation model of industrial wireless network is established. The simulation shows that TMNP-scheduling algorithm is not only effective in reducing time-out problems of periodic communication tasks, but also improving throughput of non-periodic communication tasks.